package mybinarytree;

public class Test {
    public static void main(String[] args) {
        MyBinaryTree tree = new MyBinaryTree();
        MyBinaryTree.TreeNode root = tree.createTree();
//        tree.preOrder(root);
//        System.out.println("=======================");
//        tree.preOrderNot(root);


//        tree.inOrder(root);
//        System.out.println();
//        tree.inOrder(root);

        tree.postOrder(root);
        System.out.println();
        tree.postOrderNot(root);

//        System.out.println(tree.treeSize(root));
//        System.out.println(tree.getLeafNodeCount(root));
//        System.out.println("=====================");
//        System.out.println(tree.getLinearNodeCount(root, 4));
//        System.out.println(tree.getHigh(root));
//        System.out.println("=====================");
//        MyBinaryTree.TreeNode treeN = tree.find(root,'H');
//        System.out.println(treeN.val);
//        System.out.println("========层序遍历======");
//        tree.linearOrder(root);

    }
}
